KINA: Karatsuba Initiated Novel Accelerator for Ring-Binary-LWE (RBLWE)-Based Post-Quantum Cryptography
نویسندگان
چکیده
Along with the National Institute of Standards and Technology (NIST) post-quantum cryptography (PQC) standardization process, lightweight PQC-related research, development have also gained substantial attention from research community. Ring-binary-learning-with-errors (RBLWE), a ring variant binary-LWE (BLWE), has been used to build promising PQC scheme for emerging Internet-of-Things (IoT) edge computing applications, namely RBLWE-based encryption (RBLWE-ENC). The parameter settings RBLWE-ENC, however, are not in favor deploying typical fast algorithms like number theoretic transform (NTT). Following this direction, work, we propose Karatsuba initiated novel accelerator (KINA) efficient implementation RBLWE-ENC. Overall, made several coherent interdependent stages efforts carry out proposed work: 1) innovatively algorithm (KA) derive major arithmetic operation RBLWE-ENC into new form high-performance operation; 2) then effectively mapped an hardware help optimization techniques; 3) provided detailed complexity analysis comparison demonstrate superior performance KINA, e.g., design $u=2$ involves 64.71% higher throughput 15.37% less area-delay product (ADP) than state-of-the-art notation="LaTeX">$n=512$ (Virtex-7). KINA offers flexible processing speed is suitable applications IoT servers. This work expected be useful development.
منابع مشابه
Ring-LWE Cryptography for the Number Theorist
In this paper, we survey the status of attacks on the ring and polynomial learning with errors problems (RLWE and PLWE). Recent work on the security of these problems [EHL, ELOS] gives rise to interesting questions about number fields. We extend these attacks and survey related open problems in number theory, including spectral distortion of an algebraic number and its relationship to Mahler me...
متن کاملA Toolkit for Ring-LWE Cryptography
Recent advances in lattice cryptography, mainly stemming from the development of ring-based primitives such as ring-LWE, have made it possible to design cryptographic schemes whose efficiency is competitive with that of more traditional number-theoretic ones, along with entirely new applications like fully homomorphic encryption. Unfortunately, realizing the full potential of ring-based cryptog...
متن کاملChallenges for Ring-LWE
As lattice cryptography becomes more widely used in practice, there is an increasing need for further cryptanalytic effort and higher-confidence security estimates for its underlying computational problems. Of particular interest is a class of problems used in many recent implementations, namely, Learning With Errors (LWE), its more efficient ring-based variant Ring-LWE, and their “deterministi...
متن کاملRing-LWE: Applications to Cryptography and Their Efficient Realization
The persistent progress of quantum computing with algorithms of Shor and Proos and Zalka has put our present RSA and ECC based public key cryptosystems at peril. There is a flurry of activity in cryptographic research community to replace classical cryptography schemes with their post-quantum counterparts. The learning with errors problem introduced by Oded Regev offers a way to design secure c...
متن کاملImplementing a Toolkit for Ring-LWE Based Cryptography in Arbitrary Cyclotomic Number Fields
Recent research in the field of lattice-based cryptography, especially on the topic of the ring-based primitive ring-LWE, provided efficient and practical ring-based cryptographic schemes, which can compete with more traditional number-theoretic ones. In the case of ring-LWE these cryptographic schemes operated mainly in power-of-two cyclotomics, which vastly restricted the variety of possible ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Very Large Scale Integration Systems
سال: 2023
ISSN: ['1063-8210', '1557-9999']
DOI: https://doi.org/10.1109/tvlsi.2023.3302289